Automata over continuous time
نویسنده
چکیده
The principal objective of this paper is to lift basic concepts of the classical automata theory from discrete to continuous (real) time. It is argued that the set of nite memory retrospective functions is the set of functions realized by /nite state devices. We show that the /nite memory retrospective functions are speed-independent, i.e., they are invariant under ‘stretchings’ of the time axis. Therefore, such functions cannot deal with metrical aspects of the reals. We classify and analyze phenomena which appear at continuous time and are invisible at discrete time. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
ON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES
In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.
متن کاملAutomata over Continuous
The principal objective of this paper is to lift basic concepts of the classical automata theory from discrete to continuous (real) time. The shift to continuous time brings to surface phenomena that are invisible at discrete time. A second major task of the paper is to provide a careful analysis of continuous time phenomena that are interesting for their own.
متن کاملEngineering constraint solvers for automatic analysis of probabilistic hybrid automata
In this article, we recall different approaches to the constraint-based, symbolic analysis of hybrid discrete-continuous systems and combine them to a technology able to address hybrid systems exhibiting both non-deterministic and probabilistic behavior akin to infinite-state Markov decision processes. To enable mechanized analysis of such systems, we extend the reasoning power of arithmetic sa...
متن کاملInclusion dynamics hybrid automata
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appear powerful but recalcitrant, neither yielding to analysis and reasoning through a purely continuous-time modeling as with systems of differential equations, nor open to inferential processes commonly used for discrete...
متن کاملTimed-Automata-Based Verification of MITL over Signals
It has been argued that the most suitable semantic model for real-time formalisms is the nonnegative real line (signals), i.e. the continuous semantics, which naturally captures the continuous evolution of system states. Existing tools like Uppaal are, however, based on ω-sequences with timestamps (timed words), i.e. the pointwise semantics. Furthermore, the support for logic formalisms is very...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 300 شماره
صفحات -
تاریخ انتشار 2003